Performance Driven Global Routing Through Gradual Refinement

Performance Driven Global Routing Through Gradual Refinement

Performance Driven Global Routing Through Gradual Re nement

We propose a heuristic for VLSI interconnect global routing that can optimize routing congestion delay and number of bends which are often competing objectives Routing exibilities under timing constraints are obtained and exploited to reduce congestion subject to timing constraints The wire routes are determined through gradual re nement according to probabilistic estimation on congestions so t...

Provably good performance-driven global routing

We propose a provably good performance-driven global routing algorithm for both cell-based and building-block design. The approach is based on a new bounded-radius minimum routing tree formulation. We first present several heuristics with good performance, based on an analog of Prim's minimum spanning tree construction. Next, we give an algorithm which simultaneously minimizes both routing cost...

Timing-Constrained Congestion-Driven Global Routing

It is well known that congestion control becomes more and more important in modern grid-based routing process. In this paper, a timing-constrained congestion-driven global routing approach is proposed to obtain initial congestion-driven global routing result without destroying the timing constraint of any routing net, and a post-processing simulated-annealingbased rip-up-and-reroute improvement...

Gradual Refinement Types Extended Version with Proofs

Refinement types are an effective language-based verification technique. However, as any expressive typing discipline, its strength is its weakness, imposing sometimes undesired rigidity. Guided by abstract interpretation, we extend the gradual typing agenda and develop the notion of gradual refinement types, allowing smooth evolution and interoperability between simple types and logicallyrefin...